Low-Complexity Multiantenna Downlink Scheduling

This paper proposes a low-complexity scheduling algorithm with opportunistic channel state feedback using zero-forcing dirty paper coding (ZF-DPC) or zero-forcing (ZF). Whereas some existing schemes suffer a delay to update the serving users, the proposed algorithm continues to update the serving users immediately at each opportunistic channel feedback. Due to this dynamic serving user adaptation, it outperforms the existing schemes under the same amount of channel feedback.